Monophonic Inustrument Identification
نویسنده
چکیده
This report talks about monophonic musical instrument recognition using cepstral coefficients as the features.The data set comprised of 347 samples of nine musical instruments belonging to the woodwinds, brass and string families. Classification was carried out using a multinomial logistic regression model and 10-fold cross-validation was used to validate the model. Using about 0.4 seconds of audio from the samples, the accuracy achieved in recognizing the family of instruments correctly was 77% and the accuracy in individual instrument identification was 50%.
منابع مشابه
Detour Monophonic Graphoidal Covering Number of Corona Product Graph of Some Standard Graphs with the Wheel
A chord of a path $P$ is an edge joining two non-adjacent vertices of $P$. A path $P$ is called a monophonic path if it is a chordless path. A longest $x-y$ monophonic path is called an $x-y$ detour monophonic path. A detour monophonic graphoidal cover of a graph $G$ is a collection $psi_{dm}$ of detour monophonic paths in $G$ such that every vertex of $G$ is an internal vertex of at most on...
متن کاملSpectrogram Based Musical Instrument Identification Using Hidden Markov Model (hmm) for Monophonic and Polyphonic Music Signals
Spectrogram is generated for musical notes, which is used to calculate the spectral, temporal and modulation features. To detect the musical instruments from polyphonic and monophonic musical notes , 23 features are analyzed . Out of 23 features 12 specific features are used to generate feature vector . Hidden Markov model (HMM) is used to calculate the conditional instrument existence probabil...
متن کاملForcing Total Detour Monophonic Sets in a Graph
For a connected graph G = (V,E) of order at least two, a total detour monophonic set of a graph G is a detour monophonic set S such that the subgraph induced by S has no isolated vertices. The minimum cardinality of a total detour monophonic set of G is the total detour monophonic number of G and is denoted by dmt(G). A subset T of a minimum total detour monophonic set S of G is a forcing total...
متن کاملUpper Edge Detour Monophonic Number of a Graph
For a connected graph G of order at least two, a path P is called a monophonic path if it is a chordless path. A longest x−y monophonic path is called an x − y detour monophonic path. A set S of vertices of G is an edge detour monophonic set of G if every edge of G lies on a detour monophonic path joining some pair of vertices in S. The edge detour monophonic number of G is the minimum cardinal...
متن کاملMonophonic Distance in Graphs
For any two vertices u and v in a connected graph G, a u − v path is a monophonic path if it contains no chords, and the monophonic distance dm(u, v) is the length of a longest u − v monophonic path in G. For any vertex v in G, the monophonic eccentricity of v is em(v) = max {dm(u, v) : u ∈ V}. The subgraph induced by the vertices of G having minimum monophonic eccentricity is the monophonic ce...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017